#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 1010;
int n, m, q;
LL f[N][N]; // 差分矩阵
// 差分矩阵的性质
void insert(int x1, int y1, int x2, int y2){
    f[x1][y1] += k;
    f[x2+1][y1] -= k;
    f[x1][y1+1] -= k;
    f[x2+1][y2+1] += k;
}
int main(){
    cin >> n >> m >> q;
    for(int i = 1; i <= n; ++i){
        for(int j = 1; j <= m; ++j){
            LL x; cin >> x;
            insert(i, j, i, j);
        }
    }
    while(q--){
        LL x1, y1, x2, y2, k; cin >> x1 >> y1 >> x2 >> y2 >> k;
        insert(x1, y1, x2, y2, k);
    }
    // 利用前缀和还原出修改之后的数组
    for(int i = 1; i <= n; ++i){
        for(int j = 1; j <= m; ++j){
            f[i][j] = f[i][j] - f[i-1][j-1] + f[i][j-1] + f[i-1][j];
            cout << f[i][j] << " ";
        }
        cout << '\n';
    }
    return 0;
}